Operational and denotational semantics for the box algebra
نویسندگان
چکیده
منابع مشابه
Operational and Denotational Semantics for the Box Algebra
This paper describes general theory underpinning the operational semantics and the denota-tional Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process expressions are given. For the net semantics, a general mechanism of re-nement and relabelling is introduced, using which the connectives of the algebra are deened. The paper also d...
متن کاملOperational and Denotational Semantics
The types are , ::= Nat ∣ → . All the terms in the language come with explicit types. In particular, we assume an infinite, countable set of variables of each type , and write x for a variable of type . The terms t of type (in short, t : ) are defined by induction on their size by : – every variable x is of type ; – if N : , then x ⋅N is a term of type → ; – if M : → and N : , then MN is a term...
متن کاملDenotational and Operational Semantics for Prolog
The semantics of Prolog programs is usually given in terms of the model theory of first order logic. However, this does not adequately characterize the computational behavior of Prolog programs. Prolog implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as non-logical features like ‘‘cut’’. In this work we devel...
متن کاملFrom Operational to Denotational Semantics
In this paper it is shown how operational semantic methods may be naturally extended to encompass many of the concepts of denotational semantics. This work builds on the standard development of an operational semantics as an interpreter and operational equivalence. The key addition is an operational ordering on sets of terms. From properties of this ordering a closure construction directly yiel...
متن کاملOperational and Denotational Semantics of Rewrite Programs
In this paper we present a new operational and denotational semantics for rewrite systems as logic programs. The main feature of our rewrite programs is that they allow us to define predicates not only by implications as in Prolog, but also by equivalences. We give a few examples showing how rewrite programs may turn out to be more effective than Prolog programs in capturing the user’s intended...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00180-1